Fast ICP Algorithm Using a One-Dimensional Search

نویسندگان

  • Woo-Shik Kim
  • Rae-Hong Park
چکیده

To automatically construct a three-dimensional (3-D) object model, it is necessary to merge a set of range images acquired from different views. The iterative closest point (ICP) algorithm has been widely used to find the transformation parameters between a pair of images. In this paper, a fast ICP algorithm is proposed by restricting the search space to one-dimensional (1-D) orthogonal lines to find transformation parameters such as rotations and translations between the reference model and the object model. The experimental result shows that the proposed algorithm is fast and accurate for estimation of the transformation parameters compared with the original ICP algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-Resolution ICP with Heuristic Closest Point Search for Fast and Robust 3D Registration of Range Images

The iterative closest point (ICP) algorithm is widely used for the registration of 3D geometric data. One of the main drawbacks of the algorithm is its quadratic time complexity O(N) with the number of points N. Consequently, several methods have been proposed to accelerate the process. This paper presents a new solution for the speeding up of the ICP algorithm and special care is taken to avoi...

متن کامل

One-Dimensional Modeling of Helicopter-Borne Electromagnetic Data Using Marquardt-Levenberg Including Backtracking-Armijo Line Search Strategy

In the last decades, helicopter-borne electromagnetic (HEM) method became a focus of interest in the fields of mineral exploration, geological mapping, groundwater resource investigation and environmental monitoring. As a standard approach, researchers use 1-D inversion of the acquired HEM data to recover the conductivity/resistivity-depth models. Since the relation between HEM data and model ...

متن کامل

Calculation of One-dimensional Forward Modelling of Helicopter-borne Electromagnetic Data and a Sensitivity Matrix Using Fast Hankel Transforms

The helicopter-borne electromagnetic (HEM) frequency-domain exploration method is an airborne electromagnetic (AEM) technique that is widely used for vast and rough areas for resistivity imaging. The vast amount of digitized data flowing from the HEM method requires an efficient and accurate inversion algorithm. Generally, the inverse modelling of HEM data in the first step requires a precise a...

متن کامل

A Multi-Resolution Scheme ICP Algorithm for Fast Shape Registration

The iterative closest point (ICP) algorithm is widely used for the registration of geometric data. One of its main drawbacks is its quadratic time complexity O(N) with the shapes number of points N, which implies long processing time, especially when using high resolution data. This paper proposes to accelerate the process by a coarse to fine multiresolution approach in which a solution at a co...

متن کامل

Quantification of Parkinson Tremor Intensity Based On EMG Signal Analysis Using Fast Orthogonal Search Algorithm

The tremor injury is one of the common symptoms of Parkinson's disease. The patients suffering from Parkinson's disease have difficulty in controlling their movements owing to tremor. The intensity of the disease can be determined through specifying the range of intensity values of involuntary tremor in Parkinson patients. The level of disease in patients is determined through an empirical rang...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000